منابع مشابه
Poisson bialgebras
Related Articles Representations of some quantum tori Lie subalgebras J. Math. Phys. 54, 032302 (2013) The Poincaré algebra in rank 3 simple Lie algebras J. Math. Phys. 54, 023508 (2013) Relativistic Chasles' theorem and the conjugacy classes of the inhomogeneous Lorentz group J. Math. Phys. 54, 022501 (2013) Localization in abelian Chern-Simons theory J. Math. Phys. 54, 023507 (2013) Symmetry ...
متن کاملShuffle Bialgebras
The goal of our work is to study the spaces of primitive elements of the Hopf algebras associated to the permutahedra and the associahedra. We introduce the notion of shuffle bialgebras, and compute the subpaces of primitive elements associated to these algebras. These spaces of primitive elements have natural structure of some type of algebras which we describe in terms of generators and relat...
متن کاملShuffle Bialgebras
The goal of our work is to study the spaces of primitive elements of the Hopf algebras associated to the permutaedra and the associaedra. We introduce the notion of shuffle and preshuffle bialgebras, and compute the subpaces of primitive elements associated to these algebras. These spaces of primitive elements are free objects for some types of algebras which we describe in terms of generators ...
متن کاملStrongly Homotopy Lie Bialgebras and Lie Quasi-bialgebras
Structures of Lie algebras, Lie coalgebras, Lie bialgebras and Lie quasibialgebras are presented as solutions of Maurer-Cartan equations on corresponding governing differential graded Lie algebras using the big bracket construction of Kosmann-Schwarzbach. This approach provides a definition of an L∞-(quasi)bialgebra (strongly homotopy Lie (quasi)bialgebra). We recover an L∞-algebra structure as...
متن کاملBialgebras and Realizations
In this paper we consider when a linear functional on a bialgebra is realized by the action of the bialgebra on a finite object. This depends on whether the action of the bialgebra on the functional is finite. We consider two specific cases: the Myhill–Nerode Theorem, which gives a condition for a language to be accepted by a finite automaton, and Fliess’ Theorem, which gives a condition for fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kyungpook mathematical journal
سال: 2008
ISSN: 1225-6951
DOI: 10.5666/kmj.2008.48.4.577